ITFComp: a compression algorithm for ARM architecture instruction trace files

نویسندگان

  • Mohammad Qasem
  • Lukas Pustina
چکیده

Testing the performance of a new computational component is costly due to the need of prototyping different setups. Therefore, trace driven hardware simulations are used. Instruction Trace Files (ITFs) are files containing traces of executed instructions in a program’s run and are used as an input for hardware simulations. ITFs tend to be large in size, causing a storage challenge. Many trace reduction techniques exist to deal with the ITFs’ storage challenge. In this paper we introduce ITFComp, a compression algorithm that combines general purpose compression methods with knowledge about ARM architecture ITFs’ structure to reduce their size. ITFComp also works on compressing data memory addresses accessed by instructions within ITFs to further reduce an ITF size. Results show a reduction of 600 times on average when combined with LZMA compression algorithm. This reduction is 4 times better than when using LZMA alone, and 10 times better than when using DEFLATE. ITFComp introduces a negligible overhead in the decompression time (less than 1%).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Trace File Compression Design with Locality and Address Difference

Trace-driven simulation is a simple, fast, and convenient approach to simulate computer architecture for power consumption, throughput, CPU time, and other factors. However, trace-driven simulation requires a massive storage space to save the trace files of benchmark programs. Therefore, an important task is how to design a compression method that reduces the storage space of trace files effici...

متن کامل

Performance Estimation of MPEG4 Algorithms on ARM based Designs using Co-Verification

MPEG4 and the proprietary data compression algorithms developed at Packet Video allow rich multimedia content to be delivered over very low bandwidth connections, such as wireless cellular protocols. While developing these compression and decompression algorithms, we needed to maximize the compute power of the 3G handset platforms and guarantee the delivery of streaming multimedia to the variet...

متن کامل

Code Compression for the Embedded ARM/THUMB Processor

Previous code compression research on embedded systems was based on typical RISC instruction code. THUMB from ARM Ltd is a compacted 16-bits instruction set showing a great code density than its original 32-bits ARM instruction. Our research shows that THUMB code is compressible and a further 10-15% code size reduction on THUMB code can be expected using our proposed new architecture – Code Com...

متن کامل

N-Tuple Compression: A Novel Method for Compression of Branch Instruction Traces

Branch predictors and processor front-ends have been the focus of a number of computer architecture studies. Typically they are evaluated separately from other components using trace-driven simulation based on instruction traces. To offer a faithful representation of processor’s workload the traces are very large, and hence difficult to manage if kept in uncompressed form. In order to reduce si...

متن کامل

SAMC: a code compression algorithm for embedded processors

In this paper we present a method for reducing the memory requirements of an embedded system by using code compression. We compress the instruction segment of the executable running on the embedded system and we show how to design a run-time decompression unit to decompress code on the y before execution. Our algorithm uses arithmetic coding in combination with a Markov model which is adapted t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015